"greedy property" meaning in All languages combined

See greedy property on Wiktionary

Noun [English]

Head templates: {{en-noun|?}} greedy property
  1. (computer science) The property of being globally solvable optimally by making optimal decisions locally. Categories (topical): Computer science
{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "greedy property",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Computer science",
          "orig": "en:Computer science",
          "parents": [
            "Computing",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89:",
          "text": "It has the greedy property (difficult to prove in time-critical contest environment!). If we make a choice that seems like the best at the moment and proceed to solve the remaining subproblem, we reach the optimal solution. We will never have to reconsider our previous choices.",
          "type": "quote"
        },
        {
          "ref": "2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 25:",
          "text": "Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure, making techniques like dynamic programming inapplicable.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "id": "en-greedy_property-en-noun-nm-f~uXi",
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "property",
          "property"
        ],
        [
          "solvable",
          "solvable"
        ],
        [
          "optimal",
          "optimal"
        ],
        [
          "local",
          "local"
        ]
      ],
      "raw_glosses": [
        "(computer science) The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "greedy property"
}
{
  "head_templates": [
    {
      "args": {
        "1": "?"
      },
      "expansion": "greedy property",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Computer science"
      ],
      "examples": [
        {
          "ref": "2013, Steven Halim, Felix Halim, Competitive Programming 3: The New Lower Bound of Programming Contests., page 89:",
          "text": "It has the greedy property (difficult to prove in time-critical contest environment!). If we make a choice that seems like the best at the moment and proceed to solve the remaining subproblem, we reach the optimal solution. We will never have to reconsider our previous choices.",
          "type": "quote"
        },
        {
          "ref": "2012, Betsy George, Sangho Kim, Spatio-temporal Networks: Modeling and Algorithms (SpringerBriefs in Computer Science), Springer Science & Business Media, →ISBN, page 25:",
          "text": "Developing efficient algorithms for computing shortest paths in a time varying spatial network is challenging because these journeys do not always display greedy property or optimal substructure, making techniques like dynamic programming inapplicable.",
          "type": "quote"
        }
      ],
      "glosses": [
        "The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "links": [
        [
          "computer science",
          "computer science"
        ],
        [
          "property",
          "property"
        ],
        [
          "solvable",
          "solvable"
        ],
        [
          "optimal",
          "optimal"
        ],
        [
          "local",
          "local"
        ]
      ],
      "raw_glosses": [
        "(computer science) The property of being globally solvable optimally by making optimal decisions locally."
      ],
      "topics": [
        "computer",
        "computing",
        "engineering",
        "mathematics",
        "natural-sciences",
        "physical-sciences",
        "science",
        "sciences"
      ]
    }
  ],
  "word": "greedy property"
}

Download raw JSONL data for greedy property meaning in All languages combined (1.9kB)


This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-12-15 from the enwiktionary dump dated 2024-12-04 using wiktextract (8a39820 and 4401a4c). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.